480A - Exams - CodeForces Solution


greedy sortings *1400

Please click on ads to support us..

C++ Code:

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<algorithm>

#define ll long long 
#define ii int

#define vll vector<ll>
#define vint vector<int>
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()

#define fr1(i, s, n, e) for(ll i=s;i>=n;i-=e)
#define fr3(i, s, n, e) for(ll i=s;i<n;i+=e)
#define fore(i, l, r) for(ii i = ii(l); i < ii(r); i++)

#define fi(vector) for(auto &i : vector)
#define fo(vector) for(auto d : vector)

#define FIO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);

using namespace std;

void FAISAL()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
}

int main()
{
    FAISAL();
    ll n, best = 0; cin >> n;
    vector < pair < ll, ll >>v(n);
    for (auto& [a, b] : v)
        cin >> a >> b;

    sort(all(v));
    fore(i, 0, n)
    {
        if (best <= v[i].second)
            best = v[i].second;
        else
            best = v[i].first;
    }
    cout << best;
}


Comments

Submit
0 Comments
More Questions

1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort